Projections of weak braided Hopf algebras

In this paper we study the projections of weak braided Hopf algebras using the notion of Yetter-Drinfeld module associated with a weak braided Hopf algebra. As a consequence, we complete the study ofthe structure of weak Hopf algebras with a projection in a braiding setting obtaining a categorical equivalencebetween the category of weak Hopf algebra projections associated with a weak Hopf algebra H living in abraided monoidal category and the category of Hopf algebras in the non-strict braided monoidal cate...     

带插值的自适应网格重构算法求解带移动热源的反应扩散方程的理论分析

本文研究一个带插值的网格重构算法求解一类带移动热源的反应扩散方程. 算法包括两步: 第一步是用旧时间网层上的计算解计算新时间层上的空间网格; 第二步是使用有限差分方法在新时间层 空间网格上离散方程, 并且将旧时间层上计算解的插值作为初始值. 对于时间, 我们获得了一阶收敛结果. 对于空间, 我们证明了使用线性插值算法的一阶收敛性和使用二次插值算法的二阶收敛性. 数值例子肯定了本文的理论结果.     

一类推广后的Feigenbaum函数方程的光滑解

考虑一类推广后的Feigenbaum函数方程｛g（0）=1,-1≤g（x）≤1,x∈[-1,1],h（g（x））=g（g（h（x）））其中h（x）是[-1,1]上的递减光滑奇函数且满足h（0）=0,-1〈h’（x）〈0,z∈[-1,1]．利用构造性方法讨论上述方程的光滑解的存在性及唯一性．     

奇异微分方程的广义Sturm--Liouville边值问题正解的存在性

By employing the fixed point theorem of cone expansion and compression of norm type, we investigate the existence of positive solutions of generalized Sturm-Liouville boundary value problems for a nonlinear singular differential equation with a parameter. Some sufficient conditions for the existence of positive solutions are established. In the last section, an example is presented to illustrate the applications of our main results.     

Optimal Runge–Kutta smoothers for the p-multigrid discontinuous Galerkin solution of the 1D Euler equations

This work presents a family of original Runge–Kutta methods specifically designed to be effective relaxation schemes in the numerical solution of the steady state solution of purely advective problems with a high-order accurate discontinuous Galerkin space discretization and a p-multigrid solution algorithm. The design criterion for the construction of the Runge–Kutta methods here developed is different form the one traditionally used to derive optimal Runge–Kutta smoothers for the h-multigrid algorithm, which are designed in order to provide a uniform damping of the error modes in the high-frequency range only. The method here proposed is instead designed in order to provide a variable amount of damping of the error modes over the entire frequency spectrum. The performance of the proposed schemes is assessed in the solution of the steady state quasi one-dimensional Euler equations for two test cases of increasing difficulty. Some preliminary results showing the performance for multidimensional applications are also presented.     

Next‐to‐next‐to‐leading order post‐Newtonian spin(1)‐spin(2) Hamiltonian for self‐gravitating binaries

We present the next‐to‐next‐to‐leading order post‐Newtonian (PN) spin(1)‐spin(2) Hamiltonian for two self‐gravitating spinning compact objects. If both objects are rapidly rotating, then the corresponding interaction is comparable in strength to a 4PN effect. The Hamiltonian is checked via the global Poincaré algebra with the center‐of‐mass vector uniquely determined by an ansatz.     

Improvements on open and traction boundary conditions for Navier–Stokes time-splitting methods

We present in this paper a numerical scheme for incompressible Navier–Stokes equations with open and traction boundary conditions, in the framework of pressure-correction methods. A new way to enforce this type of boundary condition is proposed and provides higher pressure and velocity convergence rates in space and time than found in the present state of the art. We illustrate this result by computing some numerical and physical tests. In particular, we establish reference solutions of a laminar flow in a geometry where a bifurcation takes place and of the unsteady flow around a square cylinder.     

A fast directional algorithm for high-frequency electromagnetic scattering

This paper is concerned with the fast solution of high-frequency electromagnetic scattering problems using the boundary integral formulation. We extend the O(N log N) directional multilevel algorithm previously proposed for the acoustic scattering case to the vector electromagnetic case. We also detail how to incorporate the curl operator of the magnetic field integral equation into the algorithm. When combined with a standard iterative method, this results in an almost linear complexity solver for the combined field integral equations. In addition, the butterfly algorithm is utilized to compute the far field pattern and radar cross section with O(N log N) complexity.     

Comparison of the generalized Riemann solver and the gas-kinetic scheme for inviscid compressible flow simulations

The generalized Riemann problem (GRP) scheme for the Euler equations and gas-kinetic scheme (GKS) for the Boltzmann equation are two high resolution shock capturing schemes for fluid simulations. The difference is that one is based on the characteristics of the inviscid Euler equations and their wave interactions, and the other is based on the particle transport and collisions. The similarity between them is that both methods can use identical MUSCL-type initial reconstructions around a cell interface, and the spatial slopes on both sides of a cell interface involve in the gas evolution process and the construction of a time-dependent flux function. Although both methods have been applied successfully to the inviscid compressible flow computations, their performances have never been compared. Since both methods use the same initial reconstruction, any difference is solely coming from different underlying mechanism in their flux evaluation. Therefore, such a comparison is important to help us to understand the correspondence between physical modeling and numerical performances. Since GRP is so faithfully solving the inviscid Euler equations, the comparison can be also used to show the validity of solving the Euler equations itself. The numerical comparison shows that the GRP exhibits a slightly better computational efficiency, and has comparable accuracy with GKS for the Euler solutions in 1D case, but the GKS is more robust than GRP. For the 2D high Mach number flow simulations, the GKS is absent from the shock instability and converges to the steady state solutions faster than the GRP. The GRP has carbuncle phenomena, likes a cloud hanging over exact Riemann solvers. The GRP and GKS use different physical processes to describe the flow motion starting from a discontinuity. One is based on the assumption of equilibrium state with infinite number of particle collisions, and the other starts from the non-equilibrium free transport process to evolve into an equilibrium one through particle collisions. The different mechanism in the flux evaluation deviates their numerical performance. Through this study, we may conclude scientifically that it may NOT be valid to use the Euler equations as governing equations to construct numerical fluxes in a discretized space with limited cell resolution. To adapt the Navier–Stokes (NS) equations is NOT valid either because the NS equations describe the flow behavior on the hydrodynamic scale and have no any corresponding physics starting from a discontinuity. This fact alludes to the consistency of the Euler and Navier–Stokes equations with the continuum assumption and the necessity of a direct modeling of the physical process in the discretized space in the construction of numerical scheme when modeling very high Mach number flows. The development of numerical algorithm is similar to the modeling process in deriving the governing equations, but the control volume here cannot be shrunk to zero.     

Artificial boundary conditions for the numerical solution of the Euler equations by the discontinuous galerkin method

We present artificial boundary conditions for the numerical simulation of compressible flows using high-order accurate discretizations with the discontinuous Galerkin (DG) finite element method. The construction of the proposed boundary conditions is based on characteristic analysis and applied for boundaries with arbitrary shape and orientation. Numerical experiments demonstrate that the proposed boundary treatment enables to convect out of the computational domain complex flow features with little distortion. In addition, it is shown that small-amplitude acoustic disturbances could be convected out of the computational domain, with no significant deterioration of the overall accuracy of the method. Furthermore, it was found that application of the proposed boundary treatment for viscous flow over a cylinder yields superior performance compared to simple extrapolation methods.